The collapse of supertasks
نویسنده
چکیده
A supertask consists in the performance of an infinite number of actions in a finite time. I show that any attempt to carry out a supertask will produce a divergence of the curvature of spacetime, resulting in the formation of a black hole. I maintain that supertaks, contrarily to a popular view among philosophers, are physically impossible. Supertasks, literally, collapse under their own weight.
منابع مشابه
What Is A Newtonian System? The Failure Of Energy Conservation And Determinism In Supertasks
Supertasks recently discussed in the literature purport to display a failure of energy conservation and determinism in Newtonian mechanics. We debate whether these supertasks are admissible as Newtonian systems, with Earman and Norton defending the affirmative and Alper and Bridger the negative.
متن کاملCriticism of Benacerraf’s Criticism of Modern Eleatics
I analyze here Benacerraf’s criticism of Thomson arguments on the impossibility of ω-supertasks. Although Benacerraf’s criticism is well founded, his analysis of Thomson’s lamp is incomplete. In fact, it is possible to consider a new line of argument, which Benacerraf only incidentally considered, based on the functioning laws of the lamp. This argument leads to a contradictory result that comp...
متن کاملOn Bifurcated Supertasks and Related Questions
Abstract. Bifurcated supertasks entail the actual infinite division of time (accelerated system of reference) as well as the existence of half-curves of infinite length (supertask system of reference). This paper analyzes both issues from a critique perspective. It also analyzes a conflictive case of hypercomputation performed by means of a bifurcated supertask. The results of these analyzes su...
متن کاملHypercomputation, Frege, Deleuze: Solving Thomson's Lamp
We present the first known solution to the original supertask, the Thomson Lamp Paradox. Supertasks, or infinite operations, form an integral part of the emerging study of hypercomputation (computation in excess of classical Turing machine capabilities) and are of philosophical interest for the paradoxes they engender. We also offer preliminary resources for classifying computational complexity...
متن کاملSupporting Lock-free Synchronization in Pfair-scheduled Systems ?
We consider various techniques for implementing shared objects and for accounting for object-sharing overheads in Pfair-scheduled multiprocessor real-time systems. Lock-free objects are more economical than locking techniques when implementing relatively simple objects such as buffers, stacks, queues, and lists. In this paper, we explain how to bound the duration of lock-free object accesses un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013